Bias cut

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Statistical Significance Based Graph Cut Segmentation for Shrinking Bias

Graph cut algorithms are very popular in image segmentation approaches. However, the detailed parts of the foreground are not segmented well in graph cut minimization.There are basically two reasons of inadequate segmentations: (i) Data smoothness relationship of graph energy. (ii) Shrinking bias which is the bias towards shorter paths. This paper improves the foreground segmentation by integra...

متن کامل

Setting empirical cut-offs on psychometric indicators of negative response bias: a methodological commentary with recommendations.

Malingering in neuropsychological assessment has been the subject of intense research for more than a decade and the detection methods arising from this work are diverse and sophisticated. However, the empirical findings are often presented in ways that limit the clinical utility of these techniques and may threaten their admissibility into legal proceedings. The purpose of this paper is to out...

متن کامل

Origin of tensile strength of a woven sample cut in bias directions

Textile fabrics are highly anisotropic, so that their mechanical properties including strengths are a function of direction. An extreme case is when a woven fabric sample is cut in such a way where the bias angle and hence the tension loading direction is around 45° relative to the principal directions. Then, once loaded, no yarn in the sample is held at both ends, so the yarns have to build up...

متن کامل

Maximum Cut Problem, MAX-CUT

The MAXIMUM CUT problem (MAX-CUT) is one of the simplest graph partitioning problems to conceptualize, and yet it is one of the most difficult combinatorial optimization problems to solve. The objective of MAX-CUT is to partition the set of vertices of a graph into two subsets, such that the sum of the weights of the edges having one endpoint in each of the subsets is maximum. This problem is k...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature

سال: 2007

ISSN: 0028-0836,1476-4687

DOI: 10.1038/nj7127-566a